Improving weighted information criterion by using optimization

Although artificial neural networks (ANN) have been widely used in forecasting time series, the determination of the best model is still a problem that has been studied a lot. Various approaches available in the literature have been proposed in order to select the best model for forecasting in ANN in recent years. One of these approaches is to use a model selection strategy based on the weighted information criterion (WIC). WIC is calculated by summing weighted different selection criteria which measure the forecasting accuracy of an ANN model in different ways. In the calculation of WIC, the weights of different selection criteria are determined heuristically. In this study, these weights are calculated by using optimization in order to obtain a more consistent criterion. Four real time series are analyzed in order to show the efficiency of the improved WIC. When the weights are determined based on the optimization, it is obviously seen that the improved WIC produces better results.     

Stability in cellular neural networks with a piecewise constant argument

In this paper, by using the concept of differential equations with piecewise constant arguments of generalized type [1], [2], [3] and [4], a model of cellular neural networks (CNNs) [5] and [6] is developed. The Lyapunov-Razumikhin technique is applied to find sufficient conditions for the uniform asymptotic stability of equilibria. Global exponential stability is investigated by means of Lyapunov functions. An example with numerical simulations is worked out to illustrate the results.     

A branch and cut algorithm for the hierarchical network design problem

The Hierarchical Network Design Problem consists of locating a minimum cost bi-level network on a graph. The higher level sub-network is a path visiting two or more nodes. The lower level sub-network is a forest connecting the remaining nodes to the path. We optimally solve the problem using an ad hoc branch and cut procedure. Relaxed versions of a base model are solved using an optimization package and, if binary variables have fractional values or if some of the relaxed constraints are violated in the solution, cutting planes are added. Once no more cuts can be added, branch and bound is used. The method for finding valid cutting planes is presented. Finally, we use different available test instances to compare the procedure with the best known published optimal procedure, with good results. In none of the instances we needed to apply branch and bound, but only the cutting planes.     

一种快速且全局收敛的BP神经网络学习算法

目前误差反向传播(BP)算法在训练多层神经网络方面有很多成功的应用.然而,BP算法也有一些不足:收敛缓慢和易陷入局部极小点等.提出一种快速且全局收敛的BP神经网络学习算法,并且对该优化算法的全局收敛性进行分析和详细证明.实证结果表明提出的算法比标准的BP算法效率更高且更精确.     

用在线梯度法训练积单元神经网络的收敛性分析

<正>1引言仅由加和单元构成的传统前向神经网络已经广泛应用于模式识别及函数逼近等领域.但在处理比较复杂的问题时,这种网络往往需要补充大量的隐节点,这样就不可避免地增     

神经网络在棱镜摄谱仪定量分析光谱中的应用

给出了采用BP神经网络拟合标准光源在棱镜摄谱仪的谱平面位置和相应波长的非线性函数,省去了和标准铁谱比对测量未知谱线波长,简化了光谱的定量分析,提高了仪器的自动化和智能化水平.     

用户需求行为对互联网动力学整体特性的影响

由Internet构成的复杂网络的动力学特性主要受到用户需求行为的影响,具备时域的统计规律性. 通过对区域群体用户需求行为的时域实验统计分析,发现用户对Web网站的访问频度及其生成的二分网络的入度分布也呈现幂律分布和集聚现象,其幂指数介于1.7到1.8之间. 建立了虚拟资源网络VRN和物理拓扑网络PTN双层模型,分析了双层模型映射机理,并对网络用户需求行为进行建模. 虚拟资源网络VRN对物理拓扑网络PTN映射过程的不同机理,模拟了Internet资源网络到物理网络的不同影响模式. 幂律分布的用户需求特性会 关键词： 复杂网络 无标度拓扑 用户需求 相变     

多重边融合复杂动态网络的自适应同步

基于网络拆分的思想对多重边融合复杂动态网络局部和全局的自适应同步进行了研究.通过给出严格的数学定义及假设,运用Lyapunov稳定理论得出了网络局部和全局的同步准则,给出了更为简单的网络同步的控制器.最后以Lorenz 系统为例进行数值仿真,验证了结论的正确性和有效性. 关键词： 多重边融合复杂动态网络 自适应同步 网络拆分 时滞     

一类不确定延迟神经网络的自适应投影同步

研究了一类参数不确定的延迟神经网络的投影同步,基于Lyapunov稳定性理论,设计了一种新型的自适应控制方法.该方法能同时实现一类参数不确定延迟神经网络的参数识别和投影同步.数值模拟证明了该方法的有效性. 关键词： 延迟神经网络 Lyapunov稳定性理论 参数识别 投影同步     

在二部无标度网上的两性疾病传播

利用易感-感染-易感(SIS)传播模型研究人类性接触网上的病毒传播.当仅仅考虑异性性接触时,该网络是一个二部的无标度网.对这个网络上的SIS传播模型,通过率方程的方法分析了男性感染率和女性感染率与传染阈值之间的关系,发现女性感染者与男性感染者之比由网络的拓扑和男女感染率之比所确定.这一结果表明性接触网的拓扑对性传染病传播的重要性.最后给出了支持理论结果的数值模拟. 关键词： 性传染病 两性性接触网 无标度网络 二部图